Packing two copies of a tree into its third power
نویسندگان
چکیده
منابع مشابه
A note on the packing of two copies of some trees into their third power
It is proved in [l] that if a tree T of order n is not a star, then there exists an edgedisjoint placement of two copies of this tree into its fourth power. In this paper, we prove the packing of some trees into their third power. @ 2003 Eisevier Ltd. Ali rights reserved. Keywords-Embedding, Packing, Permutation, Placement, Power tree.
متن کاملOn the packing of two copies of a caterpillar in its third power
H. Kheddouci, J.F. Saclé and M. Woźniak conjectured in 2000 that if a tree T is not a star, then there is an edge-disjoint placement of T into its third power. In this paper, we prove the conjecture for caterpillars.
متن کاملPacking four copies of a tree into a complete graph
A graph G of order n is k-placeable if there exist k edge-disjoint copies of G in the complete graph Kn. Previous work characterized all trees that are k-placeable for k ≤ 3. This work extends those results by giving a complete characterization of all 4-placeable trees.
متن کاملLabeled Packing of Non Star Tree into its Fifth Power and Sixth Power
In this paper we prove that we can find a labeled packing of a non star tree T into T 6 with mT + dn−mT 5 e labels, where n is the number of vertices of T and mT is the maximum number of leaves that can be removed from T in such a way that the obtained graph is a non star tree. Also, we prove that we can find a labeled packing of a non star tree T into T 5 with mT +1 labels and a labeled packin...
متن کاملA note on packing of two copies of a hypergraph
A 2-packing of a hypergraph H is a permutation σ on V (H) such that if an edge e belongs to E(H), then σ(e) does not belong to E(H). We prove that a hypergraph which does not contain neither empty edge ∅ nor complete edge V (H) and has at most 12n edges is 2-packable. A 1-uniform hypergraph of order n with more than 1 2n edges shows that this result cannot be improved by increasing the size of H.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2006
ISSN: 0012-365X
DOI: 10.1016/j.disc.2006.04.019